Yet Another Distributed Depth-First-Search Algorithm

In a recent paper [1], Awerbuch suggests a distributed depth-first-search (DDFS) algorithm that improves the time complexity of the previous DDFS algorithm of Cheung [2]. The communication cost of the algorithm of [I] is 41 E I messages and the time complexity is less than 41V 1, where E is the set of undirected links and V is the set of nodes of the communication network. This is compared to 21 E 1 for both complexities in the previous algorithm of [2]. This paper presents a DDFS algorithm that uses no more than 31 E 1 messages and 2 I V I units of time, thus improving both the communication and the time complexities of [I]. In addition, as in [1 ], no FIFO rule of message delivery is needed for the operation of the DDFS algorithm.